Pursuit- Evasion Games
نویسندگان
چکیده
Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can occur. For example, there exist graphs G in which, for any optimal mixed strategy, Red never selects a vertex in the center of G.
منابع مشابه
Vision-based Detection of Autonomous Vehicles for Pursuit-evasion Games
We present a vision-based algorithm for the detection of multiple autonomous vehicles for a pursuit-evasion game scenario. Our algorithm computes estimates of the pose of multiple moving evaders from visual information collected by multiple moving pursuers, without previous knowledge of the segmentation of the image measurements or the number of moving evaders. We evaluate our algorithm in purs...
متن کاملModel Checking Knowledge in Pursuit Evasion Games
In a pursuit-evasion game, one or more pursuers aim to discover the existence of, and then capture, an evader. The paper studies pursuit-evasion games in which players may have incomplete information concerning the game state. A methodology is presented for the application of a model checker for the logic of knowledge and time to verify epistemic properties in such games. Experimental results a...
متن کاملThe Role of Sensing Information in Pursuit-evasion Games
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix
متن کاملGame Theory Models for Pursuit Evasion Games
In a pursuit evasion game, the pursuer tries to capture the evader while the evader tries to prevent this capture. A classical approach is to model this game as an infinite differential game. In this report, we model a pursuit-evasion game as a finite extensive form game, and show that the differential game is a generalization of this game. We prove that a pure-strategy Nash equilibrium always ...
متن کاملGuaranteed Strategies for nonlinear Multi-Player Pursuit-Evasion Games
In this paper, we provide a methodology to design strategies for either guaranteed capture or guaranteed evasion in the case of pursuit-evasion games with multiple players which are represented by nonlinear dynamic models. This methodology is based on the continuously differentiable upper and lower approximations of the minimum and maximum function of an arbitrary number of arguments, compariso...
متن کامل